H∞ Controller for Consensus of Swarm Agents with Complete and Incomplete Communication Graphs
نویسندگان
چکیده
منابع مشابه
the relationship of wtc with communication apprehension and self-perceived communication competene in english and persian context
بیشتر تحقیقات پیشین در زمینه تمایل به برقراری ارتباط به رابطه آن با عوامل فردی چون سن، جنس، نوع شخصیت و... صورت گرفته است. در صورتی که مطالعات کمتری به بررسی رابطه تمایل به برقراری ارتباط زبان آموزان فارسی زبان با ترس از برقراری ارتباط و توانش خود ادراکانه آنها در برقراری ارتباط در محیط فارسی و انگلیسی انجام شده است. بر اساس نظریه الیس (2008) تمایل به برقراری ارتباط جایگاه مهمی در زمینه آموزش م...
15 صفحه اولMETA-HEURISTIC ALGORITHMS FOR MINIMIZING THE NUMBER OF CROSSING OF COMPLETE GRAPHS AND COMPLETE BIPARTITE GRAPHS
The minimum crossing number problem is among the oldest and most fundamental problems arising in the area of automatic graph drawing. In this paper, eight population-based meta-heuristic algorithms are utilized to tackle the minimum crossing number problem for two special types of graphs, namely complete graphs and complete bipartite graphs. A 2-page book drawing representation is employed for ...
متن کاملIterative Byzantine Vector Consensus in Incomplete Graphs
This work addresses Byzantine vector consensus (BVC), wherein the input at each process is a d-dimensional vector of reals, and each process is expected to decide on a decision vector that is in the convex hull of the input vectors at the fault-free processes [3, 8]. The input vector at each process may also be viewed as a point in the d-dimensional Euclidean space R, where d > 0 is a finite in...
متن کاملUnmediated communication in games with complete and incomplete information
In this paper we study the effects of adding unmediated communication to static, finite games of complete and incomplete information. We characterize SU (G), the set of outcomes of a game G, that are induced by sequential equilibria of cheap talk extensions. A cheap talk extension of G is an extensive-form game in which players communicate before playing G. A reliable mediator is not available ...
متن کاملConsensus, communication and knowledge: An extension with Bayesian agents
Parikh and Krasucki [1990] showed that pairwise communication of the value of a function f leads to a consensus about the communicated value if the function f is convex. They showed that union consistency of f may not be sufficient to guarantee consensus in any communication protocol. Krasucki [1996] proved that consensus occurs for any union consistent function if the protocol contains no cycl...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Applied Sciences
سال: 2009
ISSN: 1812-5654
DOI: 10.3923/jas.2009.1929.1935